Foundations of empirical memory consistency testing
نویسندگان
چکیده
منابع مشابه
Arithmetical Foundations - Recursion. Evaluation. Consistency
Recursive maps, nowadays called primitive recursive maps, PR maps, have been introduced by Gödel in his 1931 article for the arithmetisation, gödelisation, of metamathematics. For construction of his undecidable formula he introduces a nonconstructive, non-recursive predicate beweisbar, provable. Staying within the area of categorical free-variables theory PR of primitive recursion or appropria...
متن کاملLong Memory or Structural Change: Testing Method and Empirical Examination
In this paper, we focus on how to test for long-range dependence when the process may have a one-time mean change and how to estimate the change point when data may be long-range dependent. We rst analyzed why traditional long-memory tests have serious size distortions when data have short memory with breaks. In order to overcome this problem, a local Whittle method is proposed. Simulation resu...
متن کاملNeurocognitive Foundations of Human Memory
Memory research has traditionally been segregated into (a) research on the cognitive organization of memory and (b) research on the brain basis of memory. As a result of this segregation, cognitive theories of memory have generally evolved in isolation from neuroscientific theories of memory, and vice versa. Moreover, cognitive theorists have regularly found that neural evidence is not relevant...
متن کاملLinear Consistency Testing
We extend the notion of linearity testing to the task of checking linear-consistency of multiple functions. Informally, functions are “linear” if their graphs form straight lines on the plane. Two such functions are “consistent” if the lines have the same slope. We propose a variant of a test of Blum, Luby and Rubinfeld [8] to check the linear-consistency of three functions f1, f2, f3 mapping a...
متن کاملTesting Database Transaction Consistency
AGENDA is a tool set for testing relational database applications. In this paper we extend AGENDA to test transaction consistency. Two levels of checks are used to check both database state and state transition. The transition check validates the state transition performed by the transaction. The state check validates that the overall global consistency properties hold for the new database stat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2020
ISSN: 2475-1421
DOI: 10.1145/3428294